Random and Exhaustive Generation of Permutations and Cycles
نویسندگان
چکیده
منابع مشابه
Random and exhaustive generation of permutations and cycles
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known. We consider both methods in a unified way, and discuss their relation with exhaustive generation methods. We analyse several random variables associat...
متن کاملSpatial Random Permutations and Infinite Cycles
We consider systems of spatial random permutations, where permutations are weighed according to the point locations. Infinite cycles are present at high densities. The critical density is given by an exact expression. We discuss the relation between the model of spatial permutations and the ideal and interacting quantum Bose gas.
متن کاملCycles of Free Words in Several Independent Random Permutations
In this text, extending results of [Ni94] and [Ne05], we study the asymptotics of the number of cycles of a given length of a word in several independent random permutations with restricted cycle lengths. Specifically, for A1,. . . , Ak non empty sets of positive integers and for w word in the letters g1, g −1 1 , . . . , gk, g −1 k , we consider, for all n such that it is possible, an independ...
متن کاملCycles of Random Permutations with Restricted Cycle Lengths
We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in a forthcoming paper [BG], where we prove results about cycles of random permutations which can be written as free words in several independent random permut...
متن کاملCycles and Patterns in Permutations
We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating functions for inversions, ascents, descents, 123s, valleys, 1’-2-1s; closed forms for avoidance of peaks, 2-3-1s, 1-2-3s, 2’-1-2s and 1’-2-1s; bijective pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2009
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-009-0003-3